MUTUAL EXCLUSION BETWEEN RELATED PHAGES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mutual exclusion between related phages.

The term mutual exclusion is used to designate an extreme form of interference which often occurs when two phage particles attack the same host cell. The cell liberates numerous particles of one of the parental types and not a single particle of the other parental type (Delbruck and Luria, 1942; Dulbriick, 1945). Mutual exclusion is the rule when the two infecting particles are very dissimilar....

متن کامل

When does a correct mutual exclusion algorithm guarantee mutual exclusion?

Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...

متن کامل

Time Bounds for Mutual Exclusion and Related Problems ( Extended

We establish trade-o s between time complexity and writeand access-contention for solutions to the mutual exclusion problem. The write-contention (accesscontention) of a concurrent program is the number of processes that may be simultaneously enabled to write (access) the same shared variable. Our notion of time complexity distinguishes between local and remote references to shared memory. We s...

متن کامل

Mutual exclusion revisited

A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come firstserved algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris’s solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mu...

متن کامل

Mutual Exclusion by Interpolation

The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. The la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Bacteriology

سال: 1952

ISSN: 0021-9193,1098-5530

DOI: 10.1128/jb.63.2.209-217.1952